Simultaneous media playout

ABSTRACT

A system and method have been provided for achieving simultaneous media playout in a network including a server and a plurality of clients. The method comprises: from a server, supplying a media stream to clients at a first bitrate (R 1 ); determining the network delivery requirement; and, in response to the network delivery requirements, modifying the supply of the media stream. Determining the network delivery requirements includes determining either the buffering capacities of the clients, or the media streaming disruptions. To determine the buffering capacities of the clients, a first minimum client buffering capacity (C 1 ) is determined by polling the clients for their respective buffering capacities, and selecting the first minimum buffering capacity (C 1 ) to be equal to the client with the smallest buffering capacity.

RELATED APPLICATIONS

This application is a Continuation of a patent application entitled,SYSTEM AND METHOD FOR CONTROLLING MEDIA PLAYOUT, invented by SachinDeshpande, Ser. No. 09/944,012, filed Aug. 31, 2001, now U.S. Pat. No.7,047,308 which is incorporated herein by reference.

BACKGROUND OF THE INVENTION

1. Field of the Invention

This invention generally relates to multicast or unicast mediacommunications and, more particularly, to a system and method forcreating simultaneous media playout at multiple heterogeneous clients.

2. Description of the Related Art

In a streaming media system, a server typically streams media data tomultiple clients. Each client has its own capability, which may bedifferent than other clients. For example, each client may havedifferent amount of buffering space available. The server streams thesame media stream to all the clients in a multicast session. The goal isfor all these clients with different buffering capabilities, is toachieve a simultaneous playback of the media stream. One application ofa multicast session is a home-network environment where a single audioserver streams a song to multiple client devices, perhaps in differentrooms of a home, so that the clients achieve a simultaneous playout of asong.

Because each client has different buffering capabilities, the serverneeds to adapt its streaming whenever a new client joins the session orleaves the session. When a media packet is transmitted from the serverto the clients, the packet may have a variable delay before reaching theclients. This variation in the end-to-end delay is called jitter. Asnoted by Schulzrinne et al., “RTP: A transport protocol for real-timeapplications”, IETF, Jan. 2000, Sender and Receiver Report (SR, RR)packets of Real-time Transport Control Protocol (RTCP) part of Real-timeTransport Protocol (RTP) have a field interarrival jitter that capturesthe mean deviation of the difference in packet spacing at the clientcompared to the server for a pair of packets. To compensate for thejitter, a streaming media client often buffers a certain number ofpackets, and then plays them out at scheduled playout times. A typicalstreaming media system often transports packets using RTP on top of UserDatagram Protocol (UDP). UDP provides an unreliable service wheretransmitted packets can get lost, arrive out of order, or getduplicated. The client side buffering of data in a streaming mediasystem helps to alleviate the out-of-order packet delivery byrearranging the buffered packets. The client can also discard theduplicate packets. The buffering is also helpful if there is anydisruption in the streaming during the session, causing interruption instream reception for a short time.

The amount of buffering done at the client side in a streaming mediasystem is based mainly on two factors: the available client buffer size,and the acceptable delay which the user can tolerate before the mediaactually starts playing, after the time of the request. The type ofmedia encoding used may also impose a certain amount of delay before aclient can actually start to decode the received packets. This istypically the case for video encoded using any of the popular videoencoding standards (e.g. MPEG1, MPEG2, MPEG4, H.263(+)), where theframes are encoded independently (Intra=I frames) or by referring toother frames (Inter=P,B frames). The delay may also be dependent uponwhether the media is being played out is a live Stream or an on-demandarchived stream.

With respect to the first factor, the available client buffer size, eachclient can have a different buffer size. In the case where each clientis playing the same media stream in a session, it is assumed thatpackets are application data units and are independently decodable. Thisis true for majority of the audio encoding standards. The goal is toachieve a simultaneous playout of the media stream at each client.Another problem is the case where clients can join or leave the sessionmidway. Client heterogeneity and dynamic session membership are majorproblems to be addressed in multicasting.

Adaptive playout delay adjustment and synchronization of streams havebeen proposed to address the above-mentioned problems. Assuming a mediastream consisting of talkspurts interspersed with silence, adaptiveplayout algorithms have been proposed by Ramjee et al., “Adaptiveplayout mechanisms for packetizing audio applications in wide-areanetworks”, Proceedings of IEEE INFOCOM, pp. 680-688, 1994. Thesealgorithms estimate the mean and variation in end-to-end delay to adjustthe starting time for playout of each talkspurt. However, this work doesnot address the issue of multiple heterogeneous clients having differentbuffering capabilities. It is also more targeted towards an interactiveconferencing type of systems. Such a solution does not address anon-demand archived media (especially audio) distribution system, thathas a continuous media stream without separate talkspurts. Neither doesthis method address server side adaptation based on different clientbuffering capabilities.

The other class of related work addresses the problem of synchronizationbetween different media streams in a presentation session. For example,video and audio streams that need to be synchronously presented in amultimedia session. A start-up protocol to initiate synchronizedplayback of multiple media streams is proposed by Biersack et al.,“Synchronized delivery and playout of distributed multimedia steams”,Multimedia Systems, Vol. 7, No. 1, pp. 70-90, Jan. 1999. A scheme thatallows audio and video stream synchronization using a local conferencebus, is also proposed by Kouvelas et al., “Lip Synchronization for useover the Internet”, Proceedings of IEEE Globecom, Nov. 1996. Thesesystems address a set of multiple streams transmitted from one or moreservers to a single client, with the focus on achieving a synchronizedplayback of these multiple streams at that client.

Yuang et al., “Intelligent video smoother for multimediacommunications”, IEEE Journal of Selected Areas in Communications, Vol.15, No. 2, pp. 136-146, Feb. 1997, describes an intelligent neuralnetwork based video smoother that compensates for jitter and smoothesthe playout of video frames. However, these solutions do not address theissue of achieving simultaneous playback of the same media stream atmultiple heterogeneous clients having different buffering capabilities.

Further, although prior art systems describe client side buffering, noneof known solutions appear to handle simultaneous media playout atmultiple clients, where each client has a different buffer capacity.Methods designed to achieve isochronous streams appearing simultaneouslyat output ports cannot handle simultaneous playout when the buffercapacity of each client is different.

It would be advantageous if media could be played out at several clientssimultaneously, even if the clients had different buffering capacities.

It would be advantageous if simultaneous playout could be maintaineddespite disruptions in the media stream.

It would be advantageous if simultaneous playout could be maintaineddespite changes in client membership during a session.

SUMMARY OF THE INVENTION

The present invention avoids the above-mentioned problems associatedwith clients having different buffering capacities by permittingsimultaneous media playout strategies for multiple heterogeneous clientsusing server side adaptation. There are three adaptation phase problemsthat are solved by the invention. The adaptive phases are: when a clientjoins the session; when a client leaves the session; and, afterstreaming disruptions.

Accordingly, a method has been provided for achieving simultaneous mediaplayout in a network including a server and a plurality of clients. Themethod comprises: from a server, supplying a media stream to clients ata first bitrate (R1); determining the network delivery requirement; and,in response to the network delivery requirements, modifying the supplyof the media stream.

Determining the network delivery requirements includes determiningeither the buffering capacities of the clients, or the media streamingdisruptions. To determine the buffering capacities of the clients, afirst minimum client buffering capacity (C1) is determined by pollingthe clients for their respective buffering capacities, and selecting thefirst minimum buffering capacity (C1) to be equal to the client with thesmallest buffering capacity.

The method further comprises: following the supplying of media stream ata first bitrate (R1), changing clients in the network; determining thenew minimum client buffering capacity (Cnew); and, in response to thenew minimum buffering capacity (Cnew), modifying the supply of the mediastream. The supply of the media stream is modified by temporarilypausing the supply of the media stream at the first bitrate (R1) if thenew minimum buffering capacity (Cnew) is less than the first minimumbuffering capacity (C1). Alternately, the media stream bitrate istemporarily increased if the new minimum buffering capacity (Cnew) isgreater than the first minimum buffering capacity (C1), or if it hasbeen determined that the supply of the media stream has been disrupted.

Additional details of the above-described simultaneous media playoutmethod, and a system for achieving simultaneous media playout in anetwork are described below.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a schematic block diagram of the present invention system forachieving simultaneous media playout in a network.

FIGS. 2 through 4 illustrate three examples, where a new client having alower buffering capability joins the session midway (at time m), thuslowering the buffer capacity.

FIGS. 5 a through 5 c illustrate additional examples of the presentinvention adaptation process.

FIGS. 6 through 8 illustrate a scenario where a client leaves thesession midway (at time m), thus increasing the buffering capacity.

FIGS. 9 a and 9 b are flowcharts illustrating the present inventionmethod for achieving simultaneous media playout in a network including aserver and a plurality of clients.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

FIG. 1 is a schematic block diagram of the present invention system forachieving simultaneous media playout in a network. The system 100comprises a server 102 having a network connection port to supply amedia stream at a first bitrate (R1) on a network 104. The server 102determines network delivery requirements and, in response, modifies thesupply of the media stream. At least one client has a network connectionport to receive the media stream. Shown are client one (106), client two(108), and client M (110). However, the invention is not limited to anyparticular number of clients. The clients 106-110 transmit theirbuffering capacities to the server 102.

The server 102 determines the network delivery requirements in responseto determining the buffering capacities of the clients. Further, theserver determines network delivery requirements in response todetermining media streaming disruptions.

With respect to determining the buffering capacity of the clients106-110, the server 102 determines the first minimum client bufferingcapacity (C1). The server 102 polls the clients 106-110 for theirrespective buffering capacities and each client 106-110 transmits theirbuffering capacity to the server 102, in response to the poll. Theserver 102 determines the first minimum buffering capacity (C1) to beequal to the client with the smallest buffering capacity.

Each client schedules the playout to be at a time equal to a first timeinterval (t1) plus the minimum buffering capacity divided by the firstbitrate (C1/R1). Prior to supplying a media stream at the first bitrate(R1), the server 102 communicates the first minimum buffering capacity(C1) to the clients. Each client receives the value t1 as a timestamp ofthe first buffered frame in the media stream. As part of the normalplayout procedure, each client 106-110 reorders out-of-order mediapackets, handles any lost media packets, and schedules the playout ofthe media packets at a uniform rate in response to the media type andthe first bitrate (R1) because the media stream includes media packetswith a timestamp.

One major problem addressed by the present invention is that of adding,or removing clients from the network. For example, after supplying themedia stream at a first bitrate R1 to client one (106) and client two(108), an additional client, client M (110) is added to the network 104.The server 102 determines the new minimum client buffering capacity(Cnew), in response to the addition of the new client 110 andcommunicates the new minimum buffering capacity (Cnew) to the clients106-110. Then, the server 102 modifies the supply of media stream inresponse to the new minimum buffering capacity (Cnew).

The addition or removal of clients from the network can either raise orlower the new minimum buffering capacity. If the buffering capacity islowered, the server 102 modifies the supply of the media stream bytemporarily pausing the supply of the media stream at the first bitrate(R1). If the buffering capacity is increased, the server 102 temporarilyincreases the media stream bitrate. Prior to modifying the supply of themedia stream, the server 102 communicates the new minimum bufferingcapacity (Cnew) to the clients 106-110.

More specifically, the server 102 temporarily pauses the supply of themedia stream if the new minimum buffering capacity (Cnew) is less thanthe first minimum buffering capacity (C1). The server 102 temporarilypauses the supply of the media stream by pausing for a time equal to thefirst minimum buffering capacity minus the new minimum bufferingcapacity, divided by the first bitrate ((C1−Cnew)/R1). Typically, theserver 102 communicates media stream modifications to the clients usingreal-time-streaming protocol (RTSP). However, the present invention isnot limited to any particular type of protocol. There are manypre-exiting protocols that can be modified for use with the system 100.

The server 102 temporarily increases the media stream bitrate if eitherthe new minimum buffering capacity (Cnew) is greater than the firstminimum buffering capacity (C1), or the server 102 determines that thesupply of the media stream has been disrupted. The server 102temporarily increases the media stream bitrate if the new minimumbuffering capacity is greater than the first minimum buffering capacityby polling the clients and itself to determine the minimum bitrate(Rmin). That is, the server 102 determines the maximum rate at whicheach client can receive a media stream, and the rate at which it cantransmit. The device with the smallest bandwidth is the gating device,and the minimum bitrate (Rmin) is set to be equal to the smallestbandwidth. Note, that the minimum bitrate (Rmin) is greater than thefirst bitrate (R1). Then, the server 102 supplies the media stream atthe minimum bitrate (Rmin) for a time equal to the new minimum bufferingcapacity minus the first minimum buffering capacity, divided by theminimum bitrate minus the first bitrate ((Cnew−C1)/(Rmin−R1).

To ease the above-mentioned calculations, the present invention uses theconcept of a current_buffer_level and a target_buffer_level. Thetarget_buffer_level is the same as the first minimum buffering capacity.Typically, the server 102 supplies media stream data as media packets.The server 102 first determines the current buffer level (Cc), which isthe number of media packets buffered at each client 106-110. If the newminimum buffering capacity is less than the current buffer level, theserver temporarily pauses the supply of media stream for a time equal tothe current buffer level minus the new minimum buffering capacity,divided by the first bitrate ((Cc−Cnew)/R1). This calculation leads tothe same results as the equation ((C1−Cnew)/R1) mentioned above.

If the new minimum buffering capacity is greater than the current bufferlevel, the server 102 polls the clients 106-110 and itself to determinethe minimum bitrate (Rmin), as mentioned above, and supplies the mediastream at the minimum bitrate (Rmin) for a time equal to the new minimumbuffering capacity minus the current buffer level, divided by theminimum bitrate minus the first bitrate ((Cnew−Cc)/(Rmin−R1). Theequation leads to the same results as equation ((Cnew−C1)/(Rmin−R1)mentioned above.

The server 102 also temporarily increases the media stream bitrate if ithas been determined that the media stream has been disrupted. The server102 polls the clients 106-110 and itself to determine the minimumbitrate (Rmin), and supplies the media stream at the minimum bitrate(Rmin) for a time equal to new minimum buffering capacity minus thecurrent buffering capacity, divided by the minimum bitrate minus thefirst bitrate ((Cnew−Cc)/(Rmin−R1).

In some aspects of the invention, the server 102 includes a tracker 110to maintain a current-buffer-level measurement of the number of mediapackets being supplied by the server and a target-buffer-levelmeasurement of the new minimum client buffer. The server 102 modifiesthe supply of the media stream in response to the current-buffer-leveland target-buffer-level measurements maintained by the tracker 110,using the equations mentioned above.

Below, some examples are given of the above-mentioned system 100 inoperation, and additional details to understand the problems solved withthe use of the present invention.

Adaptation Phase when a Client Joins the Session on the Network

Assume that the media is encoded, although the same analysis holds truefor uncompressed media data, at a bitrate of R1 bits per second (bps).Frame-based media encoding is also assumed. Various audio codingstandards (e.g. G.723, G.728, G.729, GSM, MP3, etc.) fall under thiscategory. Also assume that there are M heterogeneous clients havingbuffer sizes {C₁, C₂, . . . , C_(M)} bits, currently receiving the mediastream. Every time a new client joins to receive the current mediastream, the server queries its buffering capabilities. Assuming theclient and server to be using Real-time Streaming Protocol (RTSP), theserver could query the client buffering capability using a transactionsimilar to one shown below.

Getting Client Buffer Size:

Server→Client:

-   GET_PARAMETER rtsp://myhomenw.com/filez/song1.mp3-   RTSP1.0-   CSeq: 1089-   Content-type: text/parameters-   Session: 8438-   Content-length: 18-   CRLF-   buffer_size_bits-   CRLF    Client→Server:-   RTSP/1.0 200 OK-   CSeq: 1089-   Content-length: 24-   Content-type: text/parameters-   CRLF-   buffer_size_bits: 64000-   CRLF

The server keeps track of the buffering capabilities of each client. LetC1 bits denote the minimum buffer size of the currently participatingclients, i.e. C1=Min(C₁, C₂, . . . , CM). It is assumed that each mediapacket streamed has a sequence number and a timestamp field (each RTPpacket has a sequence number and a timestamp field). The sequence numbercan be used at the client side to detect duplicate, out-of-order andmissing packets. The timestamp can be used to keep track of packetjitter and also to determine the playout scheduling of packets. Everytime the buffering capacity changes as a result of a new client joiningthe media stream, with the buffering capability being equal to the leastof the currently existing clients, the server communicates the newminimum buffering capacity (Cnew) value to all the clients. Assuming theserver and client to be using RTSP, this can be done using a transactionsimilar to one shown below.

Setting Client's Buffering Level:

Server→Client:

-   SET_PARAMETER rtsp://myhomenw.com/filez/song1.mp3 RTSP/1.0-   CSeq: 1094-   Content-length: 18-   Content-type: text/parameters-   CRLF-   buffering_size: 38400-   CRLF    Client→Server:-   RTSP/1.0 200 OK-   CSeq: 1094-   Content-length: 7-   Content-type: text/parameters-   CRLF-   38400-   CRLF

It is assumed that the server has also communicated the media streamfirst bitrate R1. This will typically be done as a part of the Setupprocess, or could be done using the SET_PARAMETER method as above(assuming the server and clients to be using RTSP). The media streamitself may already carry the bitrate information (e.g. MP1, MP2, MP3,G.723.1).

Every time a new client joins the session, after going through the setupand capabilities exchange process, the new client:

-   -   Buffers and re-orders the incoming packets, Schedules the        playout of the first buffered frame with timestamp=t1, at time

$\left( {{t\; 1} + \frac{C\; 1}{R\; 1}} \right),$

-   -   Schedules the playout of the next buffered frames in order at        the uniform rate based on the type of media encoding and the        first bitrate R1.

Every time a new client joins, the server goes through the steps ofsetup and capabilities exchange. If the new client changes (lowers) thebuffering capacity, assuming C1 and Cnew refer to the old and the newminimum client buffer space, the server:

-   -   Communicates the Cnew value to all the clients.    -   Pauses the media transmission for time

$\left( \frac{\left( {{C\; 1} - {Cnew}} \right)}{R\; 1} \right)$and then restarts the media delivery at the usual rate of R1. If theserver and client are using RTSP, then this pause in the mediatransmission is equivalent to a request from client as shown below:

-   -   Pause rtsp://myhomenw.com/filez/song1.mp3 RTSP/1.0    -   CSeq: 1145    -   Range: npt=48    -   Session: 8438    -   where in the above example, the pause occurs at time 48 seconds        and will last for

$\left( \frac{\left( {{C\; 1} - {Cnew}} \right)}{R\; 1} \right)$seconds.

During the adaptation period (pause period) of the server:

-   -   If a new client joins, thus lowering the current buffering        capacity, the server can just augment the pause (increase it)        based on the value of Cnew and communicate the Cnew value to the        clients. Denoting the old Cnew value as C1, and the newer value        as Cnew ((Cnew)newer). The total pause time duration, including        the already paused time, will be

$\left( \frac{\left( {{C\; 1} - {Cnew}} \right)}{R\; 1} \right).$

-   -   If a client leaves, thus increasing the current buffering        capacity, the server will complete the calculated pause before        reacting to this buffering capacity change. The adaptation at        the end of the pause period will be done according to the        procedure described in the next section.

FIGS. 2 through 4 illustrate three examples, where a new client having alower buffering capability joins the session midway (at time m), thuslowering the buffer capacity. The first example (FIG. 2) shows packettransmission at the server, packet reception at the client, and thepacket playout schedule at the client in the case when there is nointerarrival packet jitter, no out-of-order packet delivery, and nopacket loss. The second example (FIG. 3) illustrates the situation ofFIG. 2 with packet jitter and out-of-order packet delivery. The thirdexample (FIG. 4) includes packet jitter, out-of-order packet deliveryand packet loss. As can be seen from the figures, buffering can absorbthe packet jitter and out of order packets. A packet loss could behandled using some receiver-based method. This can be a simplerepetition of the last packet, a silent frame insertion, or some complexinterpolation of data surrounding the missing data.

Adaptation Phase when a Client Leaves the Session

Every time a client leaves the session (TEARDOWN message received, ifusing RTSP), the server computes new value of the minimum bufferingcapacity Cnew. If this value is higher than the previous value (C1), theserver computes minimum of the maximum available reception bandwidthamongst all the clients. This is achieved by querying the maximum clientbandwidth (bitrate) using GET_PARAMETER method. Based on the type ofconnection, this bandwidth (bitrate) may vary over time, so the serveruses the most recent estimate of the client bandwidth (bitrate).Assuming the server and client using RTSP, this estimate can also beobtained from the client in its Bandwidth header field {section 12.6 ofthe real time streaming protocol (RTSP)}. Let Rclient=Min (Rclient1,Rclient2, . . . , RclientM) be the minimum of the maximum availableclient bandwidths and assume that R min>R1. Let R_(server) be themaximum rate at which the server can stream media data. It is assumedfurther that the media stream being transmitted is already encoded andis available completely (as in case of an on-demand archived stream).Then the server can stream at a higher rate of R min=Min (Rclient,R_(server)) bps, for time

$T_{h} = \frac{{Cnew} - {C\; 1}}{{R\mspace{14mu}\min} - {R\; 1}}$seconds and then revert back to the transmission rate of R1 bps. If theserver and client are using RTSP, then this change in speed oftransmission is equivalent to the requests from the client as shownbelow:

-   Play rtsp://myhomenw.com/filez/song1.mp3 RTSP/1.0-   CSeq: 1150-   Range: npt=104-120-   Speed: 1.2-   Session: 8438-   Play rtsp://myhomenw.com/filez/song1.mp3 RTSP/1.0-   CSeq: 1150-   Range: npt=120-   Speed: 1.0-   Session: 8438

Assuming that

${\frac{R\mspace{14mu}\min}{R\; 1} = 1.2},{{{and}\mspace{14mu}\frac{{Cnew} - {C\; 1}}{{R\mspace{14mu}\min} - {R\; 1}}} = {16\mspace{14mu}{seconds}}},$the server transmission change occurs at time 104 seconds. The serveralso communicates Cnew to all the clients (which being higher thanprevious Cnew (now called C1) can be used by the clients to get ready toreceive media data at a higher rate).

FIGS. 5 a through 5 c illustrate additional examples of the presentinvention adaptation process. During the adaptation period (increasedrate transmission time period) of the server, if a newer client joins attime t, thus lowering the buffering capacity:

-   -   Case 1: If (Cnew<(R min−R1)t+C1) (FIGS. 5 a and 5 b), the server        immediately pauses the transmission for time

$\left( \frac{\left( {{C\; 1} + {\left( {{R\mspace{14mu}\min} - {R\; 1}} \right)t} - {Cnew}} \right)}{R\; 1} \right),$where t is the total duration the media was transmitted at rate R min.After this pause the server reverts back to the original transmissionrate of R1.

-   -   Case 2: If (Cnew>(R min−R1)t+C1) (FIG. 5 c), the server        calculates a newer value of Rmin, and streams at this increased        rate for time

$\frac{\left( {{Cnew} - {C\; 1}} \right) - {\left( {{R\mspace{14mu}\min} - {R\; 1}} \right)t}}{\left( {{R\mspace{14mu}\min} - {R\; 1}} \right.}.$After this increased rate transmission time period the server revertsback to the original transmission rate of R1.

-   -   Case 3: If (Cnew=(R min−R1)t+C1), server reverts the        transmission to the rate R1.

The implementation of the above three cases can be simplified byassuming a hypothetical buffer at the server side. Two variables:current_buffer_level and target_buffer_level can be used to keep trackof the fill level and the target level of the hypothetical buffer. If anewer client joins, thus lowering the buffering capacity, thetarget_buffer_level is set to the Cnew. Then, the three cases above canbe implemented as follows.

-   -   Case 1: If (target_buffer_level<current_buffer_level), the        transmission pauses for time

$\frac{\left( {{{current\_ buffer}{\_ level}} - {{target\_ buffer}{\_ level}}} \right)}{R\; 1},$then reverts back to the transmission at the rate of R1.

-   -   Case 2: If (target_buffer_level>current_buffer_level), a new        Rmin is found, where R min=Min (Rclient, R_(server)), and the        media stream is supplied at this increased rate for time

$\frac{\left( {{{target\_ buffer}{\_ level}} - {{current\_ buffer}{\_ level}}} \right)}{{R\mspace{11mu}\min} - {R\; 1}}.$Then, the media stream supply reverts back to rate R1.

-   -   Case 3: If (target_buffer_level=current_buffer_level), the media        stream supply reverts back to the rate R1.    -   If a client leaves, thus increasing the buffering capacity, the        server does not react to this change until the end of the        current increased speed interval. The server acts on this new        change (with another possible increased speed transmission        interval) at the end of the current interval.

When a client leaves the session, thus increasing the bufferingcapacity, the server may choose to do no adaptation (increased ratetransmission). This maybe because some clients do not support increasedbandwidth reception, or because the server cannot handle the increasedspeed transmission adaptation phase for some reason. In this case, thesystem will work with a sub-optimal buffering behavior, which may resultin some missed playout schedules. Essentially the system will continueto behave as if the lower buffering capacity client is still active.

FIGS. 6 through 8 illustrate a scenario where a client leaves thesession midway (at time m), thus increasing the buffering capacity. Thefirst case (FIG. 6) shows packet transmission at the server, packetreception at the client, and the packet playout schedule at the clientin the case when there is no interarrival packet jitter, no out-of-orderpacket delivery, and no packet loss. The second case (FIG. 7) shows thesame in the presence of the packet jitter and out-of-order packetdelivery. The third case (FIG. 8) includes packet jitter, out-of-orderpacket delivery, and packet loss.

Adaptation Phase after Streaming Disruptions

During the transmission session, the network load or competing trafficcan result in congestion, and the session throughput from the server toclients can fall for a short duration. In this case after the congestionis over, the server can go through an adaptation phase similar to theadaptation phase when a client leaves the session, as mentioned above.As before, the period of high rate transmission can be calculatedthrough the two variables: current_buffer_level and target_buffer_level,to keep track of the fill level and the target level of the hypotheticalbuffer at the server side. The target_buffer_level is equal to theminimum client buffer size and the current_buffer_level is determined bykeeping track of the data streamed from the server and played out at theclients. In this case, because of the stream disruption,(target_buffer_level>current_buffer_level), the server can find a newRmin, where R min=Min (Rclient, Rerver), and stream at this increasedrate for time

$\frac{\left( {{{target\_ buffer}{\_ level}} - {{current\_ buffer}{\_ level}}} \right)}{{R\mspace{11mu}\min} - {R\; 1}}.$The server then reverts back to rate R1. If a new client joins duringthis adaptation phase, thus lowering the buffering capacity,target_buffer_level is set to the newer minimum buffering capacity Cnew,and the 3 cases as described in the previous section are checked andacted on accordingly. This adaptation phase can also be carried outevery time the difference (target_buffer_level−current_buffer_level)exceeds some threshold.

FIGS. 9 a and 9 b are flowcharts illustrating the present inventionmethod for achieving simultaneous media playout in a network including aserver and a plurality of clients. Although the method is depicted as asequence of numbered steps for clarity, no order should be inferred fromthe numbering unless explicitly stated. The method begins at Step 900.Step 902, from a server, supplies a media stream to clients at a firstbitrate (R1). Step 904 determines the network delivery requirement. Step906, in response to the network delivery requirements, modifies thesupply of the media stream.

Determining the network delivery requirements in Step 904 includesdetermining the buffering capacities of the clients, or determiningmedia streaming disruptions. When determining the buffering capacitiesof the clients, the first minimum client buffering capacity (C1) isdetermined. Determining the first minimum client buffering capacity (C1)in Step 904 includes substeps. Step 904 a polls the clients for theirrespective buffering capacities. Step 904 b determines which client hasthe smallest buffering capacity. Step 904 c selects the first minimumbuffering capacity (C1) to be equal to the client with the smallestbuffering capacity.

A further step, Step 908, at each client, schedules the playout to be ata time equal to a first time interval (t1) plus the minimum bufferingcapacity divided by the first bitrate (C1/R1). Step 901, prior tosupplying a media stream at the first bitrate (R1), communicates thefirst minimum buffering capacity (C1) to the clients.

Following the supplying of media stream at a first bitrate (R1) in Step902, Step 905 a changes clients in the network. Step 905 b determinesthe new minimum client buffering capacity (Cnew). Step 905 ccommunicates the new minimum buffering capacity (Cnew) to the clients.Step 906, in response to the new minimum buffering capacity (Cnew),modifies the supply of the media stream. Modifying the supply of themedia stream in Step 906 includes temporarily pausing the supply of themedia stream at the first bitrate (R1), or temporarily increasing themedia stream bitrate.

Temporarily pausing the supply of the media stream at the first bitrate(R1) in Step 906 includes temporarily pausing the supply of the mediastream if the new minimum buffering capacity (Cnew) is less than thefirst minimum buffering capacity (C1). More specifically, Step 906includes pausing for a time equal to the first minimum bufferingcapacity minus the new minimum buffering capacity, divided by the firstbitrate ((C1−Cnew)/R1).

Determining the new minimum buffering capacity (Cnew) in Step 905 bincludes substeps. Step 905 b 1 determines if the new minimum bufferingcapacity (Cnew) is greater than the first minimum buffering capacity(C1). Step 905 b 2 determines if the supply of the media stream has beendisrupted. Modifying the supply of the media stream in Step 906 thenincludes temporarily increasing the media stream bitrate.

Step 905 d polls the clients and the server to determine the minimumbitrate (Rmin). Then, modifying the supply of the media stream in Step906 includes supplying the media stream at the minimum bitrate (Rmin)for a time equal to the new minimum buffering capacity minus the firstminimum buffering capacity, divided by the minimum bitrate minus thefirst bitrate ((Cnew−C1)/(Rmin−R1).

In some aspects of the invention, Step 905 e, at the server, maintains acurrent_buffer_level measurement to track the number of media packetssupplied by the server. Step 905 f, at the server, maintains atarget_buffer_level measurement to track the new minimum clientbuffering capacity (Cnew). Modifying the supply of the media stream inStep 906 includes modifying the supply of the media stream in responseto the current_buffer_level and target_buffer_level measurements.

Supplying a media stream from a server to clients at a first bitrate(R1) in Step 902 includes supplying data as media packets with atimestamp. Step 905 g determines the current buffer level (Cc), which isthe number of media packets buffered at each client. Step 905 hdetermines if the new minimum buffering capacity is less than thecurrent buffer level. Modifying the supply of the media stream in Step906 includes temporarily pausing the supply of media stream for a timeequal to the current buffer level minus the new minimum bufferingcapacity, divided by the first bitrate ((Cc−Cnew)/R1).

Step 905 d still polls the clients and the server to determine theminimum bitrate (Rmin). Modifying the supply of the media stream in Step906 includes supplying the media stream at the minimum bitrate (Rmin)for a time equal to the new minimum buffering capacity minus the currentbuffer level, divided by the minimum bitrate minus the first bitrate((Cnew−Cc)/(Rmin−R1).

Determining the current_buffer_level in Step 905 g includes determiningthat the media stream has been disrupted. Then, modifying the supply ofthe media stream in Step 906 includes supplying the media stream at theminimum bitrate (Rmin) for a time equal to new minimum bufferingcapacity minus the current_buffer_level, divided by the minimum bitrateminus the first bitrate ((Cnew−Cc)/(Rmin−R1).

Communicating the media stream modifications to the clients from theserver in Steps (and Substeps of) 904 and 905 typically includes usingreal-time-streaming protocol (RTSP).

Scheduling the playout to be at a time equal to a first time interval(t1) plus the minimum buffering capacity divided by the first bitrate(C1/R1) in Step 908 includes substeps. Step 908 a, at each client,reorders out-of-order media packets. Step 908 b, at each client, handlesany lost media packets. Step 908 c, at each client, schedules theplayout of the media packets at a uniform rate in response to the mediatype and the first bitrate (R1).

A system and method have been provided for adapting the distribution ofmedia for simultaneous playout with heterogeneous clients. Some exampleshave been given of controlling the supply of media stream through thetracking of client buffering capacities. However, other variations andembodiments of the present invention will occur to those skilled in theart.

1. In a network including a server and a plurality of clients, a methodfor achieving simultaneous media playout, the method comprising: from aserver, supplying a media stream data as media packets with a timestampas a broadcast, to a plurality of clients at a first bitrate (R1);determining the network delivery requirement, including the firstminimum client buffering capacity (C1) of each client by; polling theclients for their respective buffering capacities; determining whichclient has the smallest buffering capacity; and, selecting the firstminimum buffering capacity (C1) to be equal to the client with thesmallest buffering capacity; in response to the network deliveryrequirements, modifying the supply of the media stream to enablesimultaneous playout of media packets at the plurality of clients; ateach client, scheduling media playout to be at a time equal to a firsttime interval (t1) plus the minimum buffering capacity divided by thefirst bitrate (C1/R1) by: at each client, reordering out-of-order mediapackets; at each client, handling any lost media packets; and at eachclient, scheduling the playout of the media packets at a uniform rate inresponse to the media type and the first bitrate (R1).
 2. The method ofclaim 1 wherein determining the network delivery requirements includesdetermining media streaming disruptions.
 3. The method of claim 1further comprising: prior to supplying a media stream at the firstbitrate (R1), communicating the first minimum buffering capacity (C1) tothe clients.
 4. The method of claim 3 further comprising: following thesupplying of media stream at a first bitrate (R1), changing clients inthe network; determining the new minimum client buffering capacity(Cnew); and, wherein modifying the supply of the media stream includesmodifying the supply of the media stream in response to the new minimumbuffering capacity (Cnew).
 5. The method of claim 4 wherein modifyingthe supply of the media stream includes temporarily pausing the supplyof the media stream at the first bitrate (R1), and temporarilyincreasing the media stream bitrate.
 6. The method of claim 5 furthercomprising: prior to modifying the supply of the media stream,communicating the new minimum buffering capacity (Cnew) to the clients.7. The method of claim 6 wherein temporarily pausing the supply of themedia stream at the first bitrate (R1) includes temporarily pausing thesupply of the media stream if the new minimum buffering capacity (Cnew)is less than the first minimum buffering capacity (C1).
 8. The method ofclaim 7 wherein tewporarily pausing the supply of the media stream, ifthe new minimum buffering capacity is less than the first minimumbuffering capacity, includes pausing for a time equal to the firstminimum buffering capacity minus the new minimum capacity, divided bythe first bitrate ((C1−Cnew )/R1.
 9. The method of claim 5 whereindetermining the new minimum buffering capacity includes: determining ifthe new minimum buffering capacity (Cnew) is greater than the firstminimum buffering capacity (C1); determining if the supply of the mediastream has been disrupted; and, wherein modifying the supply of themedia stream includes temporarily increasing the media stream bitrate.10. The method of claim 9 further comprising: polling the clients andthe server to determine the minimum bitrate (Rmin); and, whereinmodifying the supply of the media stream includes supplying the mediastream at the minimum bitrate (Rmin) for a time equal to the new minimumbuffering capacity minus the first minimum buffering capacity, dividedby the minimum bitrate minus the first bitrate ((Cnew−C1)/(Rmin−R1). 11.The method of claim 5 wherein supplying a media stream from a server toclients at a first bitrate (R1) includes supplying data as mediapackets; wherein determining the new minimum buffering capacityincludes: determining the current_buffer_level (Cc), which is the numberof media packets buffered at each client; determining if the new minimumbuffering capacity is less than the current buffer level; and, whereinmodifying the supply of the media stream includes temporarily pausingthe supply of media stream for a time equal to the current_buffer_levelminus the new minimum buffering capacity, divided by the first bitrate((Cc−Cnew)/R1).
 12. The method of claim 11 further comprising: pollingthe clients and the server to determine the minimum bitrate (Rmin); and,wherein modifying the supply of the media stream includes supplying themedia stream at the minimum bitrate (Rmin) for a time equal to the newminimum buffering capacity minus the current_buffer_level, divided bythe minimum bitrate minus the first bitrate ((Cnew−Cc)/(Rmin−R1). 13.The method of claim 12 wherein determining the current_buffer_levelincludes determining if the media stream has been disrupted; and,wherein modifying the supply of the media stream includes supplying themedia stream at the minimum bitrate (Rmin) for a time equal to newminimum buffering capacity minus the current_buffer_level, divided bythe minimum bitrate minus the first bitrate ((Cnew−Cc)/(Rmin−R1). 14.The method of claim 13 further comprising: at the server, maintaining acurrent_buffer_level (Cc) measurement to track the number of mediapackets supplied by the server; and at the server, maintaining atarget_buffer_level measurement to track the new minimum clientbuffering capacity (Cnew); and, wherein modifying the supply of themedia stream includes modifying the supply of the media stream inresponse to the current_buffer_level and target_buffer_levelmeasurements.
 15. The method of claim 5 further comprising: from theserver, communicating the media stream modifications to the clientsusing real-time-streaming protocol (RTSP).
 16. A system for achievingsimultaneous media playout in a network, the system comprising: a serverhaving a network connection port to supply a media stream at a firstbitrate (R1) as a broadcast to a plurality of clients, the serverdetermining network delivery requirements, including a bufferingcapacity for each client, by polling clients for their respectivebuffering capacities and determining a first minimum buffering capacity(C1) to be equal to the client with the smallest buffering capacity andprior to supplying a media stream at the first bitrate (R1),communicating the first minimum buffering capacity (C1) to clients, andin response, modifying the supply of the media stream to enable thesimultaneous playout of media packets at the plurality of clients and,the plurality of clients, each having a network connection port toreceive the media stream, to transmit their buffering capacity to theserver in response to a poll, and to schedule a media playout to be at atime equal to a first time interval (t1) plus the minimum bufferingcapacity divided by the first bitrate (C1/R1); wherein the serverdetermines a new minimum client buffering capacity (Cnew), in responseto a change in the number of clients, communicates the new minimumbuffering capacity (Cnew) to the clients, and modifies the supply ofmedia stream in response to the new minimum buffering capacity (Cnew) byperforming a process selected from the group including temporarilypausing the supply of the media stream at the first bitrate (R1) andtemporarily increasing the media stream bitrate and wherein the servertemporarily pauses the supply of the media stream if the new minimumbuffering capacity (Cnew) is less than the first minimum bufferingcapacity (C1).
 17. The system of claim 16 wherein the server determinesthe network delivery requirements in response to determining mediastreaming disruptions.
 18. The system of claim 16 wherein the servertemporarily pauses the supply of the media stream by pausing for a timeequal to the first minimum buffering capacity minus the new minimumbuffering capacity, divided by the first bitrate ((C1−Cnew)/R1).
 19. Thesystem of claim 16 wherein the server temporarily increases the mediastream bitrate as follows: if the new minimum buffering capacity (Cnew)is greater than the first minimum buffering capacity (C1); and if theserver determines that the supply of the media stream has beendisrupted.
 20. The system of claim 19 wherein the server temporarilyincreases the media stream bitrate if the new minimum buffering capacityis greater than the first minimum bufferingcapacity, by polling theclients and itself to determine the minimumbitrate (Rmin), and supplyingthe media stream at the minimum bitrate(Rmin) for a time equal to thenew minimum buffering capacity minus thefirst minimum bufferingcapacity, divided by the minimum bitrate minusthe first bitrate((Cnew−C1)/(Rmin−R1).
 21. The system of claim 16 wherein the serversupplies media stream data as media packets; wherein the sewerdetermines the current_buffer_level (Cc), which is the number of mediapackets buffered at each client, and if the new minimum bufferingcapacity is less than the current_buffer_level the server temporarilypauses the supply of media stream for a time equal to thecurrent_buffer_level minus the new minimum buffering capacity, dividedby the first bitrate ((Cc−Cnew)/R1).
 22. The system of claim 21 whereinthe server, if the new minimum buffering capacity is greater than thecurrentbuffer level, polls the clients and itself to determine theminimum bitrate(Rmin), and supplies the media stream at the minimumbitrate (Rmin) fora time equal to the new minimum buffering capacityminus thecurrent_buffer_level, divided by the minimum bitrate minus thefirst bitrate ((Cnew−Cc)/(Rmin−R1).
 23. The system of claim 22 whereinthe server temporarily increases the media stream bitrate, if it hasbeen determined that the media stream has been disrupted, by polling theclients and itself to determine the minimum bitrate (Rmin), andsupplying the media stream at the minimum bitrate (Rmin) for a timeequal to new minimum buffering capacity minus the current bufferingcapacity, divided by the minimum bitrate minus the first bitrate((Cnew−Cc)/(Rmin−R1).
 24. The system of claim 23 wherein the serverincludes a tracker to maintain a current_buffer_level measurement of thenumber of media packets being supplied by the server and atarget_buffer_level measurement of the new minimum client bufferingcapacity; and, wherein the server modifies the supply of the mediastream in response to the current_buffer_level and target_buffer_levelmeasurements maintained by the tracker.
 25. The system of claim 16wherein the server communicates media stream modifications to theclients using real-time-streaming protocol (RTSP).
 26. The system ofclaim 16 wherein the server supplies media stream data as media packetswith a timestamp; and, wherein each client reorders out-of-order mediapackets, handles any lost media packets, and schedules the playout ofthe media packets at a uniform rate in response to the media type andthe first bitrate (R1).